A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production
نویسندگان
چکیده
منابع مشابه
A New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کاملSimultaneous Lot Sizing and Scheduling in a Flexible Flow Line
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
متن کاملOptimal Production Scheduling and Lot-sizing In Yoghurt Production Lines
The lot-sizing and production scheduling problem in a real-life multi-product yoghurt production line is addressed. A new discrete/continuous time representation mixedinteger linear programming model, based on the definition of families of products, is presented. It is mainly optimized the packaging stage while timing and capacity constraints are imposed with respect to the pasteurization/homog...
متن کاملA Stochastic Lot-Sizing and Scheduling Model
Companies are trying to improve their ability to deliver and to reduce their production costs simultaneously. Nevertheless ongoing orders of customers are causing difficulties to deliver because of bottlenecks in the production. Furthermore constantly incoming customer orders effect that every actual optimal production plan with its already realized and planned guidelines has induced states tha...
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2017
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-017-9338-9